/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
string s1, s2;
ll cnt[30];
int main()
{
    IOS;
    string ans;
    cin >> s1 >> s2;
    ll len1 = s1.length();
    ll len2 = s2.length();
    for (ll i = 0; i < len1; i++)
    {
        if (s1[i] == '?')
            continue;
        cnt[s1[i] - 'a']++;
    }
    ll i = 0, j = 0;
    for (; i < len1;)
    {
        if (s1[i] == '?')
        {
            if (cnt[s2[j] - 'a'] > 0)
            {
                cnt[s2[j] - 'a']--;
            }
            else
            {
                ans.push_back(s2[j]);
                i++;
            }
            j = (j + 1) % len2;
        }
        else
        {
            ans.push_back(s1[i]);
            i++;
        }
    }
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
